1933A - Turtle Puzzle Rearrange and Negate - CodeForces Solution

#pragma GCC optimize("Ofast", "unroll-loops")
#include<bits/stdc++.h>
using namespace std;

#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ll long long
#define out(a) cout << a << " "
#define next cout << endl
#define all(v) begin(v), end(v)
#define forr(i,a,n) for(int i = a;i<n;i++)

void init_code()
{
	fast_io;
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	freopen("error.txt", "w", stderr);
#endif // ONLINE_JUDGE
}
constexpr int mod = 1e9 + 7;

int x, n, m;
vector<int>v;

void solve() {
	cin >> n;
	int sum = 0;
	while (n--) {
		cin >> x;
		sum += abs(x - 0);
	}
	cout << sum;
}

int main() {
	init_code();
	int test = 1;
	cin >> test;
	while (test--) {
		solve();
		cout << endl;
	}
}